package demo17;


public class Main {
    public static void main(String[] args){
        Tree45 tree45=new Tree45();
        String pre="ABDECF";
        String ord="DBEACF";
      Tree45.TreeNode45 root= tree45.bulidTree(pre,ord);
      System.out.println("两个序列构成的二叉树为：");
      tree45.levelorder(root);
      System.out.println();
      Tree45.TreeNode45 root1=tree45.create4();
      String S=tree45.tree(root1);
      System.out.println(S);
      System.out.println("非递归实现前序遍历:");
      tree45.pre(root);
      System.out.println();
      System.out.println("非递归实现中序遍历：");
      tree45.inorder(root);
    }
}
